Tuning Genetic Algorithms for Problems Including Neutral Networks

نویسندگان

  • Yoshiaki Katada
  • Kazuhiro Ohkura
  • Kanji Ueda
چکیده

Neutral networks, which occur in fitness landscapes containing neighboring points of equal fitness, have attracted much research interest in recent years. In this work, we applied a standard GA and an extended GA with a variable mutation rate strategy to an abstract model of neutral networks in order to investigate the effects of selection pressure and mutation rate on the speed of population movement. Our results demonstrate that speed has an optimal mutation rate and an error threshold since plotting speed against mutation rate results in a concave curve. Increasing selection pressure increased the speed of a population’s movement on a neutral network. The variable mutation rate strategy of the extended GA improved the efficiency of the search. For both GAs, we found that high selection pressure was preferable, both for increasing the speed of population movement and for avoiding the effects of an error threshold on a neutral network.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Efficient and Robust Parameter Tuning for Heuristic Algorithms

The main advantage of heuristic or metaheuristic algorithms compared to exact optimization methods is their ability in handling large-scale instances within a reasonable time, albeit at the expense of losing a guarantee for achieving the optimal solution. Therefore, metaheuristic techniques are appropriate choices for solving NP-hard problems to near optimality. Since the parameters of heuristi...

متن کامل

Tuning Genetic Algorithms for Problems Including Neutral Networks - A More Complex Case: The Terraced NK Problem -

Neutral networks, which occur in fitness landscapes containing neighboring points of equal fitness, have attracted much research interest in recent years. In a recent paper [12], we have shown that, in the case of a very simple test function, the mutation rate of a genetic algorithm is an important factor for improving the speed at which a population moves along a neutral network. Our results a...

متن کامل

Improved teaching–learning-based and JAYA optimization algorithms for solving flexible flow shop scheduling problems

Flexible flow shop (or a hybrid flow shop) scheduling problem is an extension of classical flow shop scheduling problem. In a simple flow shop configuration, a job having ‘g’ operations is performed on ‘g’ operation centres (stages) with each stage having only one machine. If any stage contains more than one machine for providing alternate processing facility, then the problem...

متن کامل

Designing a New Multi-objective Model for a Forward/Reverse Logistic Network Considering Customer Responsiveness and Quality Level

In today’s competitive world, the need to supply chain management (SCM) is more than ever. Since the purpose of logistic problems is minimizing the costs of organization to create favorable time and place for the products, SCM seek to create competitive advantage for their organizations and increase their productivity. This paper proposes a new multi-objective model for integrated forward / rev...

متن کامل

Coverage Improvement In Wireless Sensor Networks Based On Fuzzy-Logic And Genetic Algorithm

Wireless sensor networks have been widely considered as one of the most important 21th century technologies and are used in so many applications such as environmental monitoring, security and surveillance. Wireless sensor networks are used when it is not possible or convenient to supply signaling or power supply wires to a wireless sensor node. The wireless sensor node must be battery powered.C...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003